全文获取类型
收费全文 | 12884篇 |
免费 | 1042篇 |
国内免费 | 722篇 |
专业分类
化学 | 1445篇 |
晶体学 | 21篇 |
力学 | 873篇 |
综合类 | 160篇 |
数学 | 9641篇 |
物理学 | 2508篇 |
出版年
2024年 | 12篇 |
2023年 | 81篇 |
2022年 | 120篇 |
2021年 | 195篇 |
2020年 | 280篇 |
2019年 | 316篇 |
2018年 | 285篇 |
2017年 | 322篇 |
2016年 | 359篇 |
2015年 | 296篇 |
2014年 | 602篇 |
2013年 | 1266篇 |
2012年 | 655篇 |
2011年 | 692篇 |
2010年 | 642篇 |
2009年 | 768篇 |
2008年 | 826篇 |
2007年 | 846篇 |
2006年 | 716篇 |
2005年 | 576篇 |
2004年 | 512篇 |
2003年 | 439篇 |
2002年 | 498篇 |
2001年 | 432篇 |
2000年 | 337篇 |
1999年 | 337篇 |
1998年 | 280篇 |
1997年 | 243篇 |
1996年 | 227篇 |
1995年 | 204篇 |
1994年 | 165篇 |
1993年 | 142篇 |
1992年 | 120篇 |
1991年 | 107篇 |
1990年 | 92篇 |
1989年 | 69篇 |
1988年 | 56篇 |
1987年 | 69篇 |
1986年 | 60篇 |
1985年 | 61篇 |
1984年 | 67篇 |
1983年 | 21篇 |
1982年 | 49篇 |
1981年 | 34篇 |
1980年 | 33篇 |
1979年 | 34篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 20篇 |
1975年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
《Operations Research Letters》2022,50(6):699-706
A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assignment constraints which force non-uniform sampling. While intuition suggests that non-uniform sampling adversely impacts performance, this was only supported through simulations, and rigorous statements have remained elusive. Building on product-form distributions for redundancy systems, we prove the stochastic dominance of uniform sampling for a four-server system as well as arbitrary-size systems in light traffic. 相似文献
3.
《Mathematical Methods in the Applied Sciences》2018,41(9):3246-3269
The purpose of this paper is to describe the oscillatory properties of second‐order Euler‐type half‐linear differential equations with perturbations in both terms. All but one perturbations in each term are considered to be given by finite sums of periodic continuous functions, while coefficients in the last perturbations are considered to be general continuous functions. Since the periodic behavior of the coefficients enables us to solve the oscillation and non‐oscillation of the considered equations, including the so‐called critical case, we determine the oscillatory properties of the equations with the last general perturbations. As the main result, we prove that the studied equations are conditionally oscillatory in the considered very general setting. The novelty of our results is illustrated by many examples, and we give concrete new corollaries as well. Note that the obtained results are new even in the case of linear equations. 相似文献
4.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice. 相似文献
5.
Pham Duy Khanh Tran Hong Mo Trinh T. T. Tran 《Numerical Functional Analysis & Optimization》2019,40(8):924-943
Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example. 相似文献
6.
Stevo Stevi Bratislav Iri
anin Witold Kosmala Zdenk marda 《Mathematical Methods in the Applied Sciences》2019,42(5):1687-1701
Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal. 相似文献
7.
8.
Mojtaba Bakherad 《Linear and Multilinear Algebra》2019,67(5):871-885
In this paper, we define the generalised relative operator entropy and investigate some of its properties such as subadditivity and homogeneity. As application of our result, we obtain the information inequality. In continuation, we establish some reverses of the operator entropy inequalities under certain conditions by using the Mond–Pe?ari? method. 相似文献
9.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
10.
《Physics letters. A》2019,383(20):2370-2375
We consider a bosonic Josephson junction in the Bose-Hubbard two-mode approximation where some of the parameters are corrupted by physically meaningful noise processes and study the corresponding relaxation dynamics towards its equilibrium state. We show with numerical simulations that this model can essentially capture all the important features observed in a recent experiment regarding the relaxation dynamics in one-dimensional bosonic Josephson junctions, namely the damped oscillations of the population imbalance and the relative phase, as well as the large final coherence factor. We expect that this work will further motivate research about the origin of relaxation mechanism in these systems. 相似文献